Coalgebraic logic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coalgebraic Logic

We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that innnitary modal logic contains characterizing formulas. That is, every model-world pair is characterized up to bisimulation by an innnitary formula. The point of our generalization is to understand this on a deeper level. We do this by studying a frangm...

متن کامل

Coalgebraic Hybrid Logic

We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality as coalgebraic modal logic, and in particular subsumes, besides normal hybrid logics such as hybr...

متن کامل

Seminar Coalgebraic Logic

The seminar dealt with recent developments in the emerging area of coalgebraic logic and was the first Dagstuhl seminar on that topic. Coalgebraic logic is a branch of logic which studies coalgebras as models of systems and their logics. It can be seen as generalising and extending the classical theory of modal logic to more general models of systems than labelled transition systems. Traditiona...

متن کامل

Equational Coalgebraic Logic

Coalgebra develops a general theory of transition systems, parametric in a functor T ; the functor T specifies the possible one-step behaviours of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T , a logic for T -coalgebras. We compare two existing proposals, Moss’s coalgebraic logic and the logic of all predicate liftings, by providing one-step trans...

متن کامل

Coalgebraic Predicate Logic

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completeness results for two natural classes of such logics. Moreover, we show that an entirely general completeness result is not possible. We study the expr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1999

ISSN: 0168-0072

DOI: 10.1016/s0168-0072(98)00042-6